منابع مشابه
Viability Kernels and Capture Basins of Sets Under Differential Inclusions
This paper provides a characterization of viability kernels and capture basins of a target viable in a constrained subset as a unique closed subset between the target and the constrained subset satisfying tangential conditions or, by duality, normal conditions. It is based on a method devised by Hélène Frankowska for characterizing the value function of an optimal control problem as generalized...
متن کاملViability Kernels in H
In this paper, we study two new methods for approximating the viability kernel of a given set for a HH olderian diierential inclusion. We approximate this kernel by viability kernels for discrete dynam-ical systems. We prove a convergence result when the diierential inclusion is replaced by a sequence of recursive inclusions. Furthermore , when the given set is approached by a sequence of suita...
متن کاملObservability by Using Viability Kernels
The intent of this talk is to propose an alternative way to deal with observability of systems governed by ODEs, in a more general setting than the standard output equation. We show that the starting instants from which the system is observabe correspond to points of single-valuedness of a multifunction I(·), which involves the viability kernel of output domain under the augmented system. The a...
متن کاملSemigroup Kernels on Finite Sets
Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of positive definite (p.d.) kernels for two such objects that can be expressed as a function of the merger of their respective sets of components. We prove a general integral representation of such kernels and present two par...
متن کاملCSP Search with Responsibility Sets and Kernels
We introduce data structures called responsibility set and kernel. We present an algorithm FCRK, which is a modification of FC that maintains these structures and uses them for pruning of the search space. According to our experimental evaluation, FC-RK outperforms FC-CBJ on constraint networks encoding graph k-coloring instances and on non-dense random binary constraint networks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations
سال: 2000
ISSN: 1292-8119,1262-3377
DOI: 10.1051/cocv:2000106